A Network%2Daware Virtual Machine Placement and Migration Approach in Cloud Computing.

The application of BP and RBF model in the forecasting of the runoff and the sediment transport volume in Linjin section.

Constructing an Authentication Token to Access External Services in Service Aggregation.

Automatic Bug Triage using Semi%2DSupervised Text Classification.

Learning to rank audience for behavioral targeting.

Learning to rank audience for behavioral targeting.

Using search session context for named entity recognition in query.

A co%2Dlearning framework for learning user search intents from rule%2Dgenerated training data.

Transfer learning for behavioral targeting.

TSS Efficient Term Set Search in Large Peer%2Dto%2DPeer Textual Collections.
suffering from unacceptable traffic cost and poor accuracy. Precomputing term-set-based index can significantly reduce the cost but needs exponentially growing index size. Based on our observations that 1) queries are typically short and 2) users usually have limited interests, we propose a novel index pruning method, called TSS. By solely publishing the most relevant term sets from documents on the peers, TSS provides comparable search performance with a centralized solution, while the index size is reduced from exponential to the scale of O(nlog(n)). We evaluate this design through comprehensive trace-driven simulations using the TREC WT10G data collection and the query log of a major commercial search engine. Index terms—Peer-to-peer, multikeyword searching, ranking. Ç 1


Nonparametric rank%2Dbased tests of bivariate extreme%2Dvalue dependence.

Dynamic Service Selection for Service Composition with Time Constraints.

Research and Design of Extension Case Base Based on CBR.

ExSearch a novel vertical search engine for online barter business.

The Fuzzy%2DAI Modeling for Optimization of Long%2DTerm Metro Vehicle Repair.

An E%2Dlearning System Architecture Based on Web Services and Intelligent Agents.

Synthesizing Novel Dimension Reduction Algorithms in Matrix Trace Oriented Optimization Framework.

Unified Solution to Nonnegative Data Factorization Problems.

Synthesizing Novel Dimension Reduction Algorithms in Matrix Trace Oriented Optimization Framework.

Levenberg%2DMarquardt Algorithm Applied to Forecast the Ice Conditions in Ningmeng Reach of the Yellow River.

ServiceTrust Supporting Reputation%2DOriented Service Selection.

A Machine Learning Based Framework for Adaptive Mobile Learning.

A Markov chain model for integrating behavioral targeting into contextual advertising.

Probabilistic latent semantic user segmentation for behavioral targeted advertising.

Revenue optimization with relevance constraint in sponsored search.

CLHQS Hierarchical Query Suggestion by Mining Clickthrough Log.



Straightforward Feature Selection for Scalable Latent Semantic Indexing.

Optimizing search engine revenue in sponsored search.

Temporal query substitution for ad search.

The Fuzzy Synthesize Assess in Reliability and Maintainability of Military Engineer Machinery.

Optimization Way of Engineering Equipment Maintenance Based on Process Algebra.

Verification of Composite Services with Temporal Consistency Checking and Temporal Satisfaction Estimation.


A probabilistic model based approach for blended search.

Search result re%2Dranking based on gap between search queries and social tags.


How much can behavioral targeting help online advertising%3F

Text Representation.
The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucially on the choice of effective term-weighting systems. This article summarizes the insights gained in automatic term weighting, and provides baseline single-term-indexing models with which other more elaborate content analysis procedures can be compared.  
Text Semantic Representation.
In this paper, we address the problem of planning the textual organization of instructions. We take the view that natural language generation (NLG) is a mapping process of different levels of conceptual and textual representations. Within this framework, we consider the mapping between the text&#039;s semantic representation and its rhetorical structure. We argue that such a mapping is not direct, but rather many-tomany, and give concrete examples of such a phenomenon in instructional texts. We then discuss the case of two semantic elements (called here semantic carriers), namely effects and guidances, we determine by what rhetorical relations they are most frequently realized in instructional texts, and finally, we show how such a mapping can be performed automatically within a text generation system. word count:  detex ewg.tex --- wc 793 4351 28508  . . . . . . . . . . . .  Semantic Representation of the Instructional Text Conceptual Representation of the Procedure I II III IV Conceptual...
An online blog reading system by topic clustering and personalized ranking.

The moderate deviation principle for self%2Dnormalized sums of sums of i.i.d. random variables.

Forwarding index of cube%2Dconnected cycles.
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorphisms # &lt; Aut(G).  The fractional solution is shown to be close to an integral solution (depending on properties of #), and in particular becomes an integral solution for a class of graphs containing Cayley graphs. As an application we estimate asymptotically (up to additive error terms) the edge congestion of an optimal integral uniform flow (edge forwarding index) in the cube connected cycles and the butterfly.  # The research of the first author was supported by NSF grant CCR-9528228. Research of the second author was supported in part by the Hungarian NSF contracts T 016 358 and T 019 367, and by the NSF contract DMS 970 1211. 1  1 Introduction The uniform concurrent multicommodity flow (uniform flow) problem [14, 17] is the problem of supplying one unit of (fractional) flow between all ordered pairs of v...
An expert system using rough sets theory for aided conceptual design of ship%27s engine room automation.

An expert system using rough sets theory for aided conceptual design of ship%27s engine room automation.

Synchronized Submanifold Embedding for Person%2DIndependent Pose Estimation and Beyond.

Lifetime service level agreement management with autonomous agents for services provision.
In the Web services environment, Service Level Agreements (SLA) refers to mutually agreed understandings and expectations between service consumers and providers on the service provision. Although management of SLA is critical to wide adoption of Web services technologies in the real world, support for it is very limited nowadays, especially in Web service composition scenarios. There lacks adequate frameworks and technologies supporting various SLA operations such as SLA formation, enforcement, and recovery. This paper presents a novel agent-based framework which utilises the agents ’ ability of negotiation, interaction, and cooperation to facilitate autonomous SLA management in the context of service composition provision. Based on this framework, mechanisms for autonomous SLA operations are proposed and discussed. Results from simulations show that by integrating agents and Web services the framework can address issues of SLA management drawn from sophisticated service composition scenarios.
3D Measurement of Human Faces for Biometric Application by Digital Fringe Projection with Digital Light Projection %28DLP%29.

Learning the Latent Semantic Space for Ranking in Text Retrieval.

TOFA Trace Oriented Feature Analysis in Text Categorization.

TransRank A Novel Algorithm for Transfer of Rank Learning.

Web Query Prediction by Unifying Model.

Adaptation of Web Service Composition Based on Workflow Patterns.

Towards QoS%2DBased Web Services Discovery.

WCET Analysis for Multi%2DCore Processors with Shared L2 Instruction Caches.

Chord4S A P2P%2Dbased Decentralised Service Discovery Approach.

A Practical Geographic Ontology for Spatial Web Services.

Robust Watermark Algorithm Based on the Wavelet Moment Modulation and Neural Network Detection.

Path%2Dbased verification for composition of semantic web services.

Test Data Generation for C Programs with String%2DHandling Functions.

Analyzing the worst%2Dcase execution time for instruction caches with prefetching.

Cross%2Destimator design for coordinated systems Constraints

Kernel Density Estimation of traffic accidents in a network space.

An efficient method to generate feasible paths for basis path testing.

A time%2Dpredictable VLIW processor and its compiler support.

A backtracking search tool for constructing combinatorial test suites.

A time%2Dpredictable VLIW processor and its compiler support.

Exploiting virtual registers to reduce pressure on real registers.

Towards Collaborative Service Level Agreement Negotiation.

Virtual Registers Reducing Register Pressure Without Enlarging the Register File.

Document Transformation for Multi%2Dlabel Feature Selection in Text Categorization.

Local Word Bag Model for Text Categorization.

An agent%2Dbased decentralised process management framework for web service composition.

WCET analysis of instruction caches with prefetching.

Secure Routing Protocol based Trust for Ad Hoc Networks.

Query topic detection for reformulation.

A novel clustering%2Dbased RSS aggregator.

A p2p based service flow system with advanced ontology%2Dbased service profiles.

A New Upper Bound On Forwarding Index of Graphs.

Autonomous service level agreement negotiation for service composition provision.

Hybrid multi%2Dcore architecture for boosting single%2Dthreaded performance.
The scaling of technology and the diminishing return of complicated uniprocessors have driven the industry towards multicore processors. While multithreaded applications can naturally leverage the enhanced throughput of multi-core processors, a large number of important applications are single-threaded, which cannot automatically harness the potential of multi-core processors. In this paper, we propose a compiler-driven heterogeneous multicore architecture, consisting of tightly-integrated VLIW (Very Long Instruction Word) and superscalar processors on a single chip, to automatically boost the performance of single-threaded applications without compromising the capability to support multithreaded programs. In the proposed multi-core architecture, while the highperformance VLIW core is used to run code segments with high instruction-level parallelism (ILP) extracted by the compiler; the superscalar core can be exploited to deal with the runtime events that are typically difficult for the VLIW core to handle, such as L2 cache misses. Our initial experimental results by running the preexecution thread on the superscalar core to mitigate the L2 cache misses of the main thread on the VLIW core indicate that the proposed VLIW/superscalar multi-core processor can automatically improve the performance of single-threaded general-purpose applications by up to 40.8%. 1.
Evaluating instruction cache vulnerability to transient errors.

Parallelizing MCMC for Bayesian spatiotemporal geostatistical models.

SwinDeW%2DS Extending P2P Workflow Systems for Adaptive Composite Web Services.

A Coordinated Architecture for the Agent%2Dbased Service Level Agreement Negotiation ofWeb Service Composition.

Preface.
part of a series of studies in support of the California Governor’s Advisory Committee on Education Excellence. i PREFACE i LIST OF FIGURES iv
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing.

WFMS%2Dbased Data Integration for e%2DLearning.

Towards Autonomous Service Level Agreement Negotiation for Adaptive Service Composition.

An Agent Negotiation Approach for Establishment of Service Level Agreement.

A Novel Scalable Algorithm for Supervised Subspace Learning.
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as Principal Component Analysis (PCA) do not make use of the class information, and Linear Discriminant Analysis (LDA) could not be performed efficiently in a scalable way. In this paper, we propose a novel highly scalable supervised subspace learning algorithm called as Supervised Kampong Measure (SKM). It assigns data points as close as possible to their corresponding class mean, simultaneously assigns data points to be as far as possible from the other class means in the transformed lower dimensional subspace. Theoretical derivation shows that our algorithm is not limited by the number of classes or the singularity problem faced by LDA. Furthermore, our algorithm can be executed in an incremental manner in which learning is done in an online fashion as data streams are received. Experimental results on several datasets, including a very large text data set RCV1, show the outstanding performance of our proposed algorithm on classification problems as compared to PCA, LDA and a popular feature selection approach, Information Gain (IG). 1.
Diverse Topic Phrase Extraction through Latent Semantic Analysis.

Similarity of Temporal Query Logs Based on ARIMA Model.

Similarity of Temporal Query Logs Based on ARIMA Model.

An Effective System for Optical Microscopy Cell Image Segmentation

A direct%2Dconversion mixer with DC%2Doffset cancellation for IEEE 802.11a WLAN receiver.

BPEL4WS Unit Testing Test Case Generation Using a Concurrent Path Analysis Approach.

Mining Adaptive Ratio Rules from Distributed Data Sources.
Abstract. Different from traditional association-rule mining, a new paradigm called Ratio Rule (RR) was proposed recently. Ratio rules are aimed at capturing the quantitative association knowledge, We extend this framework to mining ratio rules from distributed and dynamic data sources. This is a novel and challenging problem. The traditional techniques used for ratio rule mining is an eigen-system analysis which can often fall victim to noise. This has limited the application of ratio rule mining greatly. The distributed data sources impose additional constraints for the mining procedure to be robust in the presence of noise, because it is difficult to clean all the data sources in real time in real-world tasks. In addition, the traditional batch methods for ratio rule mining cannot cope with dynamic data. In this paper, we propose an integrated method to mining ratio rules from distributed and changing data sources, by first mining the ratio rules from each data source separately through a novel robust and adaptive one-pass algorithm (which is called Robust and Adaptive Ratio Rule (RARR)), and then integrating the rules of each data source in a simple probabilistic model. In this way, we can acquire the global rules from all the local information sources adaptively. We show that the RARR technique can converge to a fixed point and is robust as well. Moreover, the integration of rules is efficient
Effective and Efficient Dimensionality Reduction for Large%2DScale and Streaming Data Preprocessing.
Abstract—Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the effectiveness of classifiers. Traditional dimensionality reduction approaches fall into two categories: Feature Extraction and Feature Selection. Techniques in the feature extraction category are typically more effective than those in feature selection category. However, they may break down when processing large-scale data sets or data streams due to their high computational complexities. Similarly, the solutions provided by the feature selection approaches are mostly solved by greedy strategies and, hence, are not ensured to be optimal according to optimized criteria. In this paper, we give an overview of the popularly used feature extraction and selection algorithms under a unified framework. Moreover, we propose two novel dimensionality reduction algorithms based on the Orthogonal Centroid algorithm (OC). The first is an Incremental OC (IOC) algorithm for feature extraction. The second algorithm is an Orthogonal Centroid Feature Selection (OCFS) method which can provide optimal solutions according to the OC criterion. Both are designed under the same optimization criterion. Experiments on Reuters Corpus Volume-1 data set and some public large-scale text data sets indicate that the two algorithms are favorable in terms of their effectiveness and efficiency when compared with other state-of-the-art algorithms. Index Terms—Feature extraction, feature selection, orthogonal centroid algorithm. 1
SwinDeW%2Da p2p%2Dbased decentralized workflow management system.

A scalable supervised algorithm for dimensionality reduction on streaming data.

A Similarity Reinforcement Algorithm for Heterogeneous Web Pages.


An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data.
Abstract. The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Inter-class Scatter (IIS) algorithm. Unlike traditional batch learners, IIS learns from a stream of training data, not a set. IIS overcomes the inherent problem of some other incremental operations such as Incremental Principal Component Analysis (PCA) and Incremental Linear Discriminant Analysis (LDA). The experimental results on the synthetic datasets show that IIS performs as well as LDA and is more robust against noise. In addition, the experiments on the Reuters Corpus Volume 1 (RCV1) dataset show that IIS outperforms state-of-the-art Incremental Principal Component Analysis (IPCA) algorithm, a related algorithm, and Information Gain in efficiency and effectiveness respectively. 1
Supervised Semi%2Ddefinite Embedding for Email Data Cleaning and Visualization.


Compiler%2Dguided register reliability improvement against soft errors.
With the scaling of technology, transient errors caused by external particle strikes have become a critical challenge for microprocessor design. As embedded processors are widely used in reliability-sensitive environments, it becomes increasingly important to develop cost-effective techniques to improve the processor reliability against soft errors. This paper focuses on studying the register file immunity against soft errors since modern processors typically employ a large number of registers, which are accessed very frequently. As a result, soft errors occurred in registers can easily propagate to functional units or the memory system, leading to silent data error (SDC) or system crash. To develop cost-effective techniques to fight soft errors for embedded processors, the first step is to understand the register file susceptibility to soft errors and its impact on the system reliability accurately. Toward this goal, this paper proposes the concept of register vulnerability factor (RVF) to characterize the probability that register transient errors can escape the register file and thus potentially impact the system reliability. Built upon the RVF concept, we then propose two cost-effective compiler-guided techniques to improve the register file reliability by lowering the RVF value. Our experiments indicate that on average, the RVF can be reduced to 9.1 % and 9.5 % by the hyperblock-based instruction re-scheduling and the reliability-oriented register assignment respectively, which can potentially lower the reliability cost significantly while protecting register files against transient errors.
Efficient Text Classification by Weighted Proximal SVM.
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension of the proximal SVM mode [3]. Previous studies on proximal SVM have focused on classification for low dimensional data and did not consider the unbalanced data cases. Such methods will meet difficulties when classifying unbalanced and high dimensional data sets such as text documents. In this work, we extend the original proximal SVM by learning a weight for each training error. We show that the classification algorithm based on this model is capable of handling high dimensional and unbalanced data. In the experiments, we compare our method with the original proximal SVM (as a special case of our algorithm) and the standard SVM (such as SVM light) on the recently published RCV1-v2 dataset. The results show that our proposed method had comparable classification quality with the standard SVM. At the same time, both the time and memory consumption of our method are less than that of the standard SVM. 1.
Text Representation From Vector to Tensor.

Supervised semi%2Ddefinite embedding for image manifolds.

A Service Workflow Management Framework Based on Peer%2Dto%2DPeer and Agent Technologies.

OCFS optimal orthogonal centroid feature selection for text categorization.
ABSTRACT 1 Text categorization is an important research area in many Information Retrieval (IR) applications. To save the storage space and computation time in text categorization, efficient and effective algorithms for reducing the data before analysis are highly desired. Traditional techniques for this purpose can generally be classified into feature extraction and feature selection. Because of efficiency, the latter is more suitable for text data such as web documents. However, many popular feature selection techniques such as Information Gain (IG) and 2 χ-test (CHI) are all greedy in nature and thus may not be optimal according to some criterion. Moreover, the performance of these greedy methods may be deteriorated when the reserved data dimension is extremely low. In this paper, we propose an efficient optimal feature selection algorithm by optimizing the objective function of Orthogonal Centroid (OC) subspace learning algorithm in a discrete solution space, called Orthogonal Centroid Feature Selection (OCFS). Experiments on 20 Newsgroups (20NG), Reuters Corpus Volume 1 (RCV1) and Open Directory Project (ODP) data show that OCFS is consistently better than IG and CHI with smaller computation time especially when the reduced dimension is extremely small.
SimFusion measuring similarity using unified relationship matrix.
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks, user clickthrough sequences). We claim that iterative computations over the URM can help overcome the data sparseness problem and detect latent relationships among heterogeneous data objects, thus, can improve the quality of information applications that require com-bination of information from heterogeneous sources. To support our claim, we present a unified similarity-calculating algorithm, SimFusion. By iteratively computing over the URM, SimFusion can effectively integrate relationships from heterogeneous sources when measuring the similarity of two data objects. Experiments based on a web search engine query log and a web page collection demonstrate that SimFusion can improve similarity measurement of web objects over both traditional content based algorithms and the cutting edge SimRank algorithm.
Incorporating state estimation into model predictive control and its application to network traffic control.

Effective Visualisation of Workflow Enactment.

Learning similarity measures in non%2Dorthogonal space.
Many machine learning and data mining algorithms crucially rely on the similarity metrics. The Cosine similarity, which calculates the inner product of two normalized feature vectors, is one of the most commonly used similarity measures. However, in many practical tasks such as text categorization and document clustering, the Cosine similarity is calculated under the assumption that the input space is an orthogonal space which usually could not be satisfied due to synonymy and polysemy. Various algorithms such as Latent Semantic Indexing (LSI) were used to solve this problem by projecting the original data into an orthogonal space. However LSI also suffered from the high computational cost and data sparseness. These shortcomings led to increases in computation time and storage requirements for large scale realistic data. In this paper, we propose a novel and effective similarity
Towards Incompletely Specified Process Support in SwinDeW %2D A Peer%2Dto%2DPeer Based Workflow System.

Online Supervised Learning for Digital Library.

Mining Ratio Rules Via Principal Sparse Non%2DNegative Matrix Factorization.
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, F.Korn et al recently proposed a paradigm named Ratio Rules [4] for quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA) and as a result, it cannot guarantee that the ratio coefficient is non-negative. This may lead to serious problems in the rules’ application. In this paper, we propose a new method, called Principal Sparse Non-Negative Matrix Factoriza-tion (PSNMF), for learning the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the importance of each rule for the entire dataset. 1.
IMMC incremental maximum margin criterion.
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or large-scale data. To meet this desirability, Incremental Principal Component Analysis (IPCA) algorithm has been well established, but it is an unsupervised subspace learning approach and is not optimal for general classification tasks, such as face recognition and Web document categorization. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Maximum Margin Criterion (IMMC), to infer an adaptive subspace by optimizing the Maximum Margin Criterion. We also present the proof for convergence of the proposed algorithm. Experimental results on both synthetic dataset and real world datasets show that IMMC converges to the similar subspace as that of batch approach.
Decentralised Coordination for Software Process Enactment.

A Data Storage Mechanism for Peer%2Dto%2DPeer Based Decentralised Workflow Systems.

Enacting Business Processes in a Decentralised Environment with p2p%2DBased Workflow Support.

